Notes on random optimization problems
نویسنده
چکیده
These notes are under construction. They constitute a combination of what I have said in the lectures, what I will say in future lectures, and what I will not say due to time constraints. Some sections are very brief, and this is generally because they are not yet written. Some of the “problems and exercises” describe things that I am actually going to write down in detail in the text. This is because I have used the problems & exercises section in this way to take short notes of things I should not forget to mention.
منابع مشابه
Two Lectures on Iterative Coding and Statistical Mechanics
These are the notes for two lectures delivered at the Les Houches summer school Mathematical Statistical Mechanics, held in July 2005. I review some basic notions on sparse graph error correcting codes with emphasis on ‘modern’ aspects, such as, iterative belief propagation decoding. Relations with statistical mechanics, inference and random combinatorial optimization are stressed, as well as s...
متن کاملAdaptation and Evolution in Dynamic Persistent Environments
Optimization (adaptation) of agents interacting with dynamic persistent environments (DPEs) poses a separate class of problems from those of static optimization. Such environments must be incorporated into models of interactive computation. By the No Free Lunch Theorem (NFLT), no general-purpose function-optimization algorithm can exist that is superior to random search. But interactive adaptat...
متن کاملar X iv : c on d - m at / 9 70 50 10 1 M ay 1 99 7 Frustrated Systems : Ground State Properties via Combinatorial Optimization ?
An introduction to the application of combinatorial optimization methods to ground state calculations of frustrated, disordered systems is given. We discuss the interface problem in the random bond Ising ferromagnet, the random field Ising model, the diluted antiferromagnet in an external field, the spin glass problem, the solid-on-solid model with a disordered substrate and other convex cost f...
متن کاملLecture Notes On Solution Methods for Representative Agent Dynamic Stochastic Optimization Problems
These lecture notes sketch a set of techniques that are useful in solving representative agent dynamic stochastic optimization problems. I make no attempt at a systematic overview of the many possible technical choices; instead, the notes present a very specific set of methods and techniques. Associated with these notes is a set of Mathematica programs that solve the problems described in the t...
متن کامل